SB-Labelings, Distributivity and Bruhat Order on Sortable Elements

نویسنده

  • Henri Mühle
چکیده

In this article, we investigate the set of γ-sortable elements, associated with a Coxeter group W and a Coxeter element γ ∈ W , under Bruhat order, and we denote this poset by Bγ . We show that this poset belongs to the class of SB-lattices recently introduced by Hersh and Mészáros, by proving a more general statement, namely that all join-distributive lattices are SB-lattices. The observation that Bγ is join-distributive is due to Armstrong. Subsequently, we investigate for which finite Coxeter groups W and which Coxeter elements γ ∈ W the lattice Bγ is in fact distributive. It turns out that this is the case for the “coincidental” Coxeter groups, namely the groups An, Bn, H3, and I2(k). We conclude this article with a conjectural characteriziation of the Coxeter elements γ of said groups for which Bγ is distributive in terms of forbidden orientations of the Coxeter diagram.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SB-labelings and posets with each interval homotopy equivalent to a sphere or a ball

We introduce a new class of edge labelings for locally finite lattices which we call SB-labelings. We prove for finite lattices which admit an SB-labeling that each open interval has the homotopy type of a ball or of a sphere of some dimension. Natural examples include the weak order, the Tamari lattice, and the finite distributive lattices.

متن کامل

Sortable Elements for Quivers with Cycles

Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W . In this paper, we define a more general notion of Ω-sortable elements, where Ω is an arbitrary orientation of the diagram, and show that the key properties of c-sortable elements...

متن کامل

Sortable Elements in Infinite Coxeter Groups

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing partitions associated to Artin groups of finite type. In this paper, as the first step towards expanding these applications beyond finite type, we study sortable el...

متن کامل

Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph

We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation, and we show how this relates to parameterizing certain spaces of paths in the Johnson graph.

متن کامل

Clusters, Coxeter-sortable Elements and Noncrossing Partitions

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014